Predicate Formal System based on 1-level Universal AND Operator and its Soundness
نویسندگان
چکیده
The aim of this paper is solving the predicate calculus formal system based on 1-level universal AND operator. Firstly, universal logic and propositional calculus formal deductive system (0 1] h UL∈ , are introduced. Secondly, a predicate calculus formal deductive system (0 1] h UL∈ , ∀ based on 1-level universal AND operator is built. Thirdly, the soundness theorem and deduction theorem of system (0 1] h UL∈ , ∀ are given, which ensure that the theorems are tautologies and the reasoning rules are valid in system (0 1] h UL∈ , ∀ .
منابع مشابه
The Predicate Formal System Based on 1-Level Universal AND Operator
The aim of this paper is the partial axiomatization for firstorder predicate calculus formal system based on first-level universal AND operator. By introducing the universal quantifier and existential quantifier, a predicate calculus formal deductive system ∀ULh∈(0,1] based on 1-level universal AND operator according to propositional calculus formal deductive system ULh∈(0,1] of universal logic...
متن کاملLiteral Projection and Circumscription
We develop a formal framework intended as a preliminary step for a single knowledge representation system that provides different representation techniques in a unified way. In particular we consider first-order logic extended by techniques for second-order quantifier elimination and non-monotonic reasoning. Background of the work is literal projection, a generalization of second-order quantifi...
متن کاملSimple Negation Scope Resolution through Deep Parsing: A Semantic Solution to a Semantic Problem
In this work, we revisit Shared Task 1 from the 2012 *SEM Conference: the automated analysis of negation. Unlike the vast majority of participating systems in 2012, our approach works over explicit and formal representations of propositional semantics, i.e. derives the notion of negation scope assumed in this task from the structure of logical-form meaning representations. We relate the task-sp...
متن کاملA Sound Semantics for OCamllight
Few programming languages have a mathematically rigorous definition or metatheory—in part because they are perceived as too large and complex to work with. This paper demonstrates the feasibility of such undertakings: we formalize a substantial portion of the semantics of Objective Caml’s core language (which had not previously been given a formal semantics), and we develop a mechanized type so...
متن کاملA Note on Constructive Modalities for Information
Kurt Gödel (1933) proved the formal correspondence between the intuitionistic truth of a formula F and its classical provability via modal necessity: if F is derivable in a calculus for intuitionistic logic, a translation of F such that each of its subformulas is prefixed by a necessity operator can be derived in the modal language S4. The inverse implication was established few years later by ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- JCP
دوره 8 شماره
صفحات -
تاریخ انتشار 2013